@InProceedings{AyresZuff:1995:MéRáDe,
author = "Ayres, F{\'a}bio Jos{\'e} and Zuffo, Marcelo Kn{\"o}rich",
affiliation = "{Grupo de Computa{\c{c}}{\~a}o Visual e M{\'{\i}}dias
Interativas do Laborat{\'o}rio de Sistemas Integr{\'a}veis (LSI)
da Escola Polit{\'e}cnica da Universidade de S{\~a}o Paulo
(USP)} and {Grupo de Computa{\c{c}}{\~a}o Visual e
M{\'{\i}}dias Interativas do Laborat{\'o}rio de Sistemas
Integr{\'a}veis (LSI) da Escola Polit{\'e}cnica da Universidade
de S{\~a}o Paulo (USP)}",
title = "Um m{\'e}todo r{\'a}pido de determina{\c{c}}{\~a}o de
visibilidade para visualiza{\c{c}}{\~a}o volum{\'e}trica",
booktitle = "Anais...",
year = "1995",
editor = "Lotufo, Roberto de Alencar and Mascarenhas, Nelson Delfino
d'{\'A}vila",
pages = "299--300",
organization = "Simp{\'o}sio Brasileiro de Computa{\c{c}}{\~a}o Gr{\'a}fica e
Processamento de Imagens, 8. (SIBGRAPI)",
publisher = "Sociedade Brasileira de Computa{\c{c}}{\~a}o",
address = "Porto Alegre",
keywords = "volume visualization, scan-line, bresenham line drawing algorithm,
volume ray-tracing.",
abstract = "This article describes a fast visibility algorithm for volume
visualization. In volume Ray-tracing an expensive step is the
visibility treatment of each voxel. The proposed algorithm
considers Cartesian volumes. Our approach is to map the bounding
faces of the volume in the image space and then use fast scan-line
algorithms to treat the visibility. Preliminar results show some
advantages of this approach over previous solutions.",
conference-location = "S{\~a}o Carlos, SP, Brazil",
conference-year = "25-27 Oct. 1995",
isbn = "978-85-7669-273-7",
language = "pt",
ibi = "8JMKD3MGPBW34M/3DJCP3E",
url = "http://urlib.net/ibi/8JMKD3MGPBW34M/3DJCP3E",
targetfile = "42 Um metodo rapido de determinacao de visibilidade.pdf",
type = "Geral (Comunica{\c{c}}{\~o}es)",
urlaccessdate = "2024, Apr. 28"
}